package exercise;

// https://leetcode.cn/problems/climbing-stairs/
public class L230704_II {

    public int climbStairs(int n) {
        int[] dp = new int[n+1];

        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i] = dp[i-1] + dp[i-2];
        }
        return dp[n];
    }


    public static void main(String[] args) {
        L230704_II s = new L230704_II();

        System.out.println(s.climbStairs(3));
    }

}
